Uniform Approximation in Various Function Classes.
نویسندگان
چکیده
منابع مشابه
Uniform approximation of Vapnik-Chervonenkis classes
For any family of measurable sets in a probability space, we show that either (i) the family has infinite Vapnik–Chervonenkis (VC) dimension or (ii) for every ε > 0 there is a finite partition π such the essential π -boundary of each set has measure at most ε. Immediate corollaries include the fact that a separable family with finite VC dimension has finite bracketing numbers, and satisfies uni...
متن کاملThe best uniform polynomial approximation of two classes of rational functions
In this paper we obtain the explicit form of the best uniform polynomial approximations out of Pn of two classes of rational functions using properties of Chebyshev polynomials. In this way we present some new theorems and lemmas. Some examples will be given to support the results.
متن کاملA method to obtain the best uniform polynomial approximation for the family of rational function
In this article, by using Chebyshev’s polynomials and Chebyshev’s expansion, we obtain the best uniform polynomial approximation out of P2n to a class of rational functions of the form (ax2+c)-1 on any non symmetric interval [d,e]. Using the obtained approximation, we provide the best uniform polynomial approximation to a class of rational functions of the form (ax2+bx+c)-1 for both cases b2-4a...
متن کاملUniform Approximation of Abhyankar Valuation Ideals in Smooth Function Fields
Let R be an n-dimensional regular local domain essentially of finite type over a ground field k of characteristic zero, and let ν be a rank one valuation centered on R. Recall that this is equivalent to asking that ν be an R-valued valuation on the fraction field K of R, taking non-negative values on R and positive values on the maximal ideal m ⊆ R. A theorem of Zariski and Abhyankar states tha...
متن کاملStructure in Approximation Classes
The study of the approximability properties of NP-hard optimization problems has recently made great advances mainly due to the results obtained in the field of proof checking. The last important breakthrough proves the APX-completeness of several important optimization problems and thus reconciles “two distinct views of approximation classes: syntactic and computational” [S. Khanna et al., in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MATHEMATICA SCANDINAVICA
سال: 1964
ISSN: 1903-1807,0025-5521
DOI: 10.7146/math.scand.a-10700